浅析智能网联汽车感知系统电磁兼容性

本文将就智能网联汽车感知系统中的电子兼容技术进行深入的分析和探究。     

A Lattice Approach to Image Segmentation

After a formal definition of segmentation as the largest partition of the space according to a criterion σ and a function f, the notion of a morphological connection is reminded. It is used as an input to a central theorem of the paper (Theorem 8), that identifies segmentation with the connections that are based on connective criteria. Just as connections, the segmentations can then be regrouped by suprema and infima. The generality of the theorem makes it valid for functions from any space to any other one. Two propositions make precise the AND and OR combinations of connective criteria. The soundness of the approach is demonstrated by listing a series of segmentation techniques. One considers first the cases when the segmentation under study does not involve initial seeds. Various modes of regularity are discussed, which all derive from Lipschitz functions. A second category of examples involves the presence of seeds around which the partition of the space is organized. An overall proposition shows that these examples are a matter for the central theorem. Watershed and jump connection based segmentations illustrate this type of situation. The third and last category of examples deals with cases when the segmentation occurs in an indirect space, such as an histogram, and is then projected back on the actual space under study. The relationships between filtering and segmentation are then investigated. A theoretical chapter introduces and studies the two notions of a pulse opening and of a connected operator. The conditions under which a family of pulse openings can yield a connected filter are clarified. The ability of segmentations to generate pyramids, or hierarchies, is analyzed. A distinction is made between weak hierarchies where the partitions increase when going up in the pyramid, and the strong hierarchies where the various levels are structured as semi-groups, and particularly as granulometric semi-groups. The last section is based on one example, and goes back over the controversy about “lattice” versus “functional” optimization. The problem is now tackled via a case of colour segmentation, where the saturation serves as a cursor between luminance and hue. The emphasis is put on the difficulty of grouping the various necessary optimizations into a single one.     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

虚拟专用网的体系结构及实现

提出VPN接入设备的体系结构 ,包括系统的应用模型、层次划分和内部详细结构 ,阐述实现VPN的关键技术。     

Means of enhancing and promoting the use of solar energy

The development of renewable technologies in the last decade has been exceptional. In photovoltaic (PV) for example, efforts were not only limited to merely improving their efficiency but also to the reduction of the cost of cells and modules via volume production for commercial markets. There are many national schemes promoting the use of PV technology and regional targets for a share of renewable energy production. This paper attempts to relay to the reader a journey, based on experience, approaches for enhancing the prospect of utilising solar energy within the society we live in. The issue of expansion or enhancing the utilisation of solar energy can be undertaken by individuals, groups, institutions and governments. The aim of this paper is to provide some examples, which could serve as a framework in which action could be taken to promote solar technology.     

A novel method of suppressing the inrush current of transformers by using a series‐connected voltage‐source PWM converter

This paper proposes a novel method of suppressing the inrush current of transformers. A small‐rated voltage‐source PWM converter is connected in series to the transformers through a matching transformer. As the connected PWM converter serves as a resistor for the source current, no inrush phenomena occurs. The required rating of the PWM converter, which serves as the damping resistor for the inrush phenomena, is 1/400 that of the main transformers in single‐phase circuits. In three‐phase circuits, it is 1/900. The basic principle of the proposed method is discussed. Digital computer simulation is implemented to confirm the validity and excellent practicability of the proposed method using the PSCAD/EMTDC. A prototype experimental model is constructed and tested. The experimental results demonstrate that the proposed method can perfectly suppress the inrush phenomena. © 2006 Wiley Periodicals, Inc. Electr Eng Jpn, 157(4): 56–65, 2006; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20174     

Analyzing the Reliability of Degradable Networks

The reachability of a strongly connected network may be destroyed after link damage,Since many networds have directed links with the potential for reversal,the reachability may be restored by reversing the direction of links.In this paper,the reliability of a network that allows reversal of links in discussed.     

无线传感器网络中d-Hop 2-连通容错支配集的分布式构造算法

无线传感器网络随节点移动组成自我维持的自组织系统,采用连通支配集的虚拟骨干技术可使平面网络系统层次化而简化节点路由、管理和维护。但大规模无线传感器网络的连通支配集节点数目依然庞大,d-hop连通支配集可以大大减小支配集节点数目。另外,由于存在节点失效、链路断裂等无线特性,虚拟骨干网需要具备一定的容错性。在单位圆盘图网络模型中为构建精简且具有容错能力的虚拟骨干网,提出d-hop 2-连通支配集的分布式构造算法,先构造d-hop独立支配集后再连通形成d-hop 2-连通支配集。并从理论和仿真上对算法的复杂度、近似比和算法性能作了进一步探讨和验证。     

基于中值滤波和梯度锐化的边缘检测

实现一种基于中值滤波和梯度锐化的边缘检测方法。首先采用既能过滤噪声又能保护边缘信息的中值滤波对图像进行平滑处理。然后采用梯度锐化加强边缘像素强度,通过简单的二值化获得图像的初始边缘,系统采用连通区域标记的方法去除位于图像封闭边界内的残留黑块。最后通过实验结果与人工提取的结果比较,进行误差分析,找出本文算法的不足之处,以便对该算法进行改进。实践证明,本文的边缘检测方法对含有噪声点且灰度分布比较均匀的图像有很好的效果。